Stability Guaranteed MPC for Mobile Robot Navigation (Extended Abstract)

نویسندگان

  • Jong Jin Park
  • Benjamin Kuipers
چکیده

A mobile robot needs to navigate in dynamic and unstructured environments. For this, motion planning algorithms must be able to handle complex, time-varying constraints presented by the environment, and quickly generate high quality trajectories that reaches the goal. Model Predictive Control (MPC) is a receding-horizon control algorithm which optimizes the performance of the constrained systems on-line. (See (Rawlings 2000) (Mayne et al. 2000) (Lee 2011) for excellent reviews.) This can be a very useful tool for mobile robot navigation in dynamic environments due to its dynamic replanning framework, its ability to handle complex time-varying constraints, and its flexible formulation which allows the user to tune the behavior of the system to desired performance. Thus the MPC and MPC-like dynamic replanning framework are becoming more popular in robotics community, e.g. (Green and Kelly 2007) (Howard, Green, and Kelly 2009) (Dolgov et al. 2010) (Knepper and Mason 2012) (Du Toit and Burdick 2012) (Park, Johnson, and Kuipers 2012). However, it can be difficult to ensure stability and temporal consistency of solutions, especially for systems with differential constraints. In this paper, we show that it is possible to provide a stability guarantee for MPC for mobile robots that can be modeled as unicycles (e.g. differentially driven carts) with a proper estimate of the cost-to-go. This critically depends on our non-holonomic distance function, which is also a control-Lyapunov function for unicycle-type vehicles. This allows us to properly estimate the cost-to-go for unicycletype vehicles, and ensure convergence via MPC. We show theoretical and numerical analysis on the stability conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mobile Robot Navigation Error Handling Using an Extended Kalman Filter

Obviously navigation is one of the most complicated issues in mobile robots. Intelligent algorithms are often used for error handling in robot navigation. This Paper deals with the problem of Inertial Measurement Unit (IMU) error handling by using Extended Kalman Filter (EKF) as an Expert Algorithms. Our focus is put on the field of mobile robot navigation in the 2D environments. The main chall...

متن کامل

Mobile Robot Navigation Error Handling Using an Extended Kalman Filter

Obviously navigation is one of the most complicated issues in mobile robots. Intelligent algorithms are often used for error handling in robot navigation. This Paper deals with the problem of Inertial Measurement Unit (IMU) error handling by using Extended Kalman Filter (EKF) as an Expert Algorithms. Our focus is put on the field of mobile robot navigation in the 2D environments. The main chall...

متن کامل

Navigation of a Mobile Robot Using Virtual Potential Field and Artificial Neural Network

Mobile robot navigation is one of the basic problems in robotics. In this paper, a new approach is proposed for autonomous mobile robot navigation in an unknown environment. The proposed approach is based on learning virtual parallel paths that propel the mobile robot toward the track using a multi-layer, feed-forward neural network. For training, a human operator navigates the mobile robot in ...

متن کامل

A New Method of Mobile Robot Navigation: Shortest Null Space

In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...

متن کامل

A New Method of Mobile Robot Navigation: Shortest Null Space

In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015